Uniqueness of Graph Square Roots of Girth Six
نویسندگان
چکیده
We prove that if two graphs of girth at least 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of girth at least 7. We also make a remark on reconstruction of graphs from their higher powers.
منابع مشابه
Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H. Determining if a given graph G is the square of some graph is not easy in general. Motwani and Sudan [11] proved that it is NP-complete to determine if a given graph G is the square of some graph. The graph introduced in their ...
متن کاملComputing Graph Roots Without Short Cycles
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H . Given H it is easy to compute its square H, however Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph H (of girth 3). In this paper we consider the characterization and recognition problems of graphs that are squ...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملOn Chromatic Uniqueness And Equivalence of K4-Homeomorphic Graphs
A K4-homeomorph is a subdivision of the complete graph with four vertices (K4). Such a homeomorph is denoted by K4(a,b,c,d,e,f) if the six edges of K4 are replaced by the six paths of length a,b,c,d,e,f, respectively. In this paper, we discuss the chromaticity of a family of K4-homeomorphs with girth 10. We also give sufficient and necessary condition for some graphs in the family to be chromat...
متن کاملColoring squares of planar graphs with girth six
Wang and Lih conjectured that for every g ≥ 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree ∆ ≥ M(g) is (∆+1)-colorable. The conjecture is known to be true for g ≥ 7 but false for g ∈ {5, 6}. We show that the conjecture for g = 6 is off by just one, i.e., the square of a planar graph G of girth at least six and sufficiently large max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011